Note on the annulus conjecture

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note about Bezdek's Conjecture on Covering an Annulus by Strips

A closed plane region between two parallel lines is called a strip. András Bezdek posed the following conjecture: For each convex region K there is an ε > 0 such that if εK lies in the interior of K and the annulus K\εK is covered by finitely many strips, then the sum of the widths of the strips must be at least the minimal width of K. In this paper, we consider problems which are related to th...

متن کامل

A note on Fouquet-Vanherpe’s question and Fulkerson conjecture

‎The excessive index of a bridgeless cubic graph $G$ is the least integer $k$‎, ‎such that $G$ can be covered by $k$ perfect matchings‎. ‎An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless‎ ‎cubic graph has excessive index at most five‎. ‎Clearly‎, ‎Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5‎, ‎so Fouquet and Vanherpe as...

متن کامل

A note on Barnette's conjecture

Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c|V (G)| vertices.

متن کامل

A note on Agrawal conjecture

We prove that Lenstra proposition suggesting existence of many counterexamples to Agrawal conjecture is true in a more general case. At the same time we obtain a strictly ascending chain of subgroups of the group (Zp[X]/(Cr(X))) * and state the modified conjecture that the set {X-1, X+2} generate big enough subgroup of this group.

متن کامل

A Note on Hadwiger’s Conjecture

Hadwiger’s Conjecture [7] states that every Kt+1-minor-free graph is t-colourable. It is widely considered to be one of the most important conjectures in graph theory; see [21] for a survey. If every Kt+1-minor-free graph has minimum degree at most δ, then every Kt+1minor-free graph is (δ+1)-colourable by a minimum-degree-greedy algorithm. The purpose of this note is to prove a slightly better ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1967

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1967-0217800-4